/* 62. 不同路径 */
/**
 * @param {number} m
 * @param {number} n
 * @return {number}
 */

/* 动态规划 */
var uniquePaths = function (m, n) {
    const dp = new Array(m).fill(0).map(() => new Array(n).fill(0))
    for (let i = 0; i < m; i++) {
        dp[i][0] = 1
    }

    for (let j = 1; j < n; j++) {
        dp[0][j] = 1
    }

    for (let i = 1; i < m; i++) {
        for (let j = 1; j < n; j++) {
            dp[i][j] = dp[i - 1][j] + dp[i][j - 1]
        }
    }

    return dp[m - 1][n - 1]
};
/* 一维dp */
var uniquePaths = function (m, n) {
    const dp = new Array(n).fill(1)
    for (let i = 1; i < m; i++) {
        for (let j = 1; j < n; j++) {
            dp[j] += dp[j - 1]
        }
    }
    return dp[n - 1]
}
const result = uniquePaths(3, 7)
console.log("result :>>", result);